3. Prove that if the input list is sorted then the resulting tree is a BST.